Number of literals: 16
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%] [110%] [120%] [130%] [140%] [150%] [160%]
Post filtering unreachable actions:  [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%] [110%] [120%] [130%] [140%] [150%] [160%]
[01;34mNo analytic limits found, not considering limit effects of goal-only operators[00m
All the ground actions in this problem are compression-safe
Initial heuristic = 9.000
b (8.000 | 1.000)b (7.000 | 2.001)b (6.000 | 2.001)b (5.000 | 3.002)b (4.000 | 4.003)b (3.000 | 5.004)b (2.000 | 6.004)b (1.000 | 7.005);;;; Solution Found
; States evaluated: 10
; Cost: 8.006
; Time 0.00
0.000: (get_order jakazu3 peanut coffee_order_1)  [1.000]
1.001: (move_into_cabin peanut anywhere neuhelium_cabin coffee_order_1)  [1.000]
1.001: (get_cup jakazu3 coffee_order_1 coffee_1)  [1.000]
2.002: (make_coffee jakazu3 coffee_order_1 neuhelium_coffee_machine coffee_1)  [1.000]
3.003: (place_cup_into_delivery_robot peanut jakazu3 neuhelium_cabin coffee_order_1 neuhelium_coffee_machine coffee_1)  [1.000]
4.004: (get_cup jakazu3 coffee_order_1 coffee_2)  [1.000]
5.004: (make_coffee jakazu3 coffee_order_1 neuhelium_coffee_machine coffee_2)  [1.000]
6.005: (place_cup_into_delivery_robot peanut jakazu3 neuhelium_cabin coffee_order_1 neuhelium_coffee_machine coffee_2)  [1.000]
7.006: (deliver_coffee peanut jakazu3 neuhelium_cabin service_table_1 coffee_order_1 coffee_1)  [1.000]
